THE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-$k$ PELL NUMBERS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-k PELL NUMBERS

In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the generalized order-k Pell numbers.

متن کامل

On The Usual Fibonacci and Generalized Order-k Pell Numbers

In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We …nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...

متن کامل

A Simplified Binet Formula for k-Generalized Fibonacci Numbers

In this paper, we present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc.). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula in order to generate the desired sequence.

متن کامل

The Binet formula, sums and representations of generalized Fibonacci p-numbers

In this paper, we consider the generalized Fibonacci p-numbers and then we give the generalized Binet formula, sums, combinatorial representations and generating function of the generalized Fibonacci p-numbers. Also, using matrix methods, we derive an explicit formula for the sums of the generalized Fibonacci p-numbers. c © 2007 Elsevier Ltd. All rights reserved.

متن کامل

On the computing of the generalized order-k Pell numbers in log time

In this paper, we consider the generalized order-k Pell numbers and present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. The theoretical basis of using a matrix method for deriving the algorithm is also discussed. 2006 Elsevier Inc. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2006

ISSN: 1027-5487

DOI: 10.11650/twjm/1500404581